Scaling up the learning-from-crowds GLAD algorithm using instance-difficulty clustering
نویسندگان
چکیده
منابع مشابه
IRAHC: Instance Reduction Algorithm using Hyperrectangle Clustering
In instance-based classifiers, there is a need for storing a large number of samples as training set. In this work, we propose an instance reduction method based on hyperrectangle clustering, called Instance Reduction Algorithm using Hyperrectangle Clustering (IRAHC). IRAHC removes non-border (interior) instances and keeps border and near border ones. This paper presents an instance reduction p...
متن کاملA New Approach in Strategy Formulation using Clustering Algorithm: An Instance in a Service Company
The ever severe dynamic competitive environment has led to increasing complexity of strategic decision making in giant organizations. Strategy formulation is one of basic processes in achieving long range goals. Since, in ordinary methods considering all factors and their significance in accomplishing individual goals are almost impossible. Here, a new approach based on clustering method is pro...
متن کاملScaling Up Word Clustering
Word clusters improve performance in many NLP tasks including training neural network language models, but current increases in datasets are outpacing the ability of word clusterers to handle them. In this paper we present a novel bidirectional, interpolated, refining, and alternating (BIRA) predictive exchange algorithm and introduce ClusterCat, a clusterer based on this algorithm. We show tha...
متن کاملa new approach in strategy formulation using clustering algorithm: an instance in a service company
the ever severe dynamic competitive environment has led to increasing complexity of strategic decision making in giant organizations. strategy formulation is one of basic processes in achieving long range goals. since, in ordinary methods considering all factors and their significance in accomplishing individual goals are almost impossible. here, a new approach based on clustering method is pro...
متن کاملActive Learning from Crowds
Obtaining labels can be expensive or timeconsuming, but unlabeled data is often abundant and easier to obtain. Most learning tasks can be made more efficient, in terms of labeling cost, by intelligently choosing specific unlabeled instances to be labeled by an oracle. The general problem of optimally choosing these instances is known as active learning. As it is usually set in the context of su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress in Artificial Intelligence
سال: 2019
ISSN: 2192-6352,2192-6360
DOI: 10.1007/s13748-019-00189-9